Fractal Image Compression on Hexagonal Structure
نویسندگان
چکیده
منابع مشابه
Fractal Image Compression on Hexagonal Structure
Image compression has many applications. For example, it is an important step for distributed and network based pattern recognition. For real time object recognition or reconstruction, image compression can greatly reduce the image size, and hence increase the processing speed and enhance performance. Fractal image compression is a relatively recent image compression method. Its basic idea is t...
متن کاملUniform Image Partitioning for Fractal Compression on Virtual Hexagonal Structure
Hexagonal structure is different from the traditional square structure for image representation. The geometrical arrangement of pixels on hexagonal structure can be described in terms of a hexagonal grid. Uniformly separating image into seven similar copies with a smaller scale has commonly been used for parallel and accurate image processing including image compression on hexagonal structure. ...
متن کاملFractal image compression
The top-selling multimedia encyclopedia Encarta, published by Microsoft Corporation, includes on one CD-ROM seven thousand color photographs which may be viewed interactively on a computer screen. The images are diverse; they are of buildings, musical instruments, people’s faces, baseball bats, ferns, etc. What most users do not know is that all of these photographs are based on fractals and th...
متن کاملFractal Image Compression
Standard graphics systems encode pictures by assigning an address and colour attribute for each point of the object resulting in a long list of addresses and attributes. Fractal geometry enables a newer class of geometrical shapes to be used to encode whole objects, thus image compression is achieved. Compression ratios of 10,000:1 have been claimed by researchers in this field. The fractal equ...
متن کاملFractal Image Compression
The first fully automated fractal image compression algorithm was published by Arnaud Jacquin in 1989. Given an image f , the encoder finds a contractive affine image transformation (fractal transform) T such that the fixed point of T is close to f . The decoding is by iteration of the fractal transform starting from an arbitrary image. Due to the contraction mapping principle, the sequence of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algorithms & Computational Technology
سال: 2008
ISSN: 1748-3026,1748-3026
DOI: 10.1260/174830108784300286